Computational Aspects of Reordering Plans

Computational Aspects of Reordering Plans

This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan less constrained and the other is to minimize its parallel execution time. Three candidate de nitions are proposed for the rst of these criteria, constituting a sequence of increasing optimality guarantees. Two of these ...

Computational aspects of hydroformylation

The influence of transition metal complexes as catalysts upon the activity and selectivity of hydroformylation reactions has been extensively investigated during the last decades. Nowadays computational chemistry is an indispensable tool for elucidation of reaction mechanisms and for understanding the various aspects which govern the outcome of catalytic reactions. This review attempts to surve...

Computational Aspects of Treewidth

Computational Aspects of NUCOMP

In 1989, Shanks introduced the NUCOMP algorithm [10] for computing the reduced composite of two positive definite binary quadratic forms of discriminant ∆. Essentially by applying reduction before composing the two forms, the intermediate operands are reduced from size O(∆) to O(∆) in most cases and at worst to O(∆). Shanks made use of this to extend the capabilities of his hand-held calculator...

Resolving Conflicts Betweenflight - Plans : Planning Aspects

This article summarises research in progress on the development of a prototype problem solver for connict resolution of ight-plans. It gives domain analyses and focuses particularly on the domain problem of connict resolution for the 4D multi-segment ight-plan clearances which gure in current methods for air traac control over the Atlantic. This domain problem involves led ight plans for air tr...